Secure “Ratio” Computation and Efficient Protocol for General Secure Two-Party Comparison
نویسندگان
چکیده
منابع مشابه
An Efficient Protocol for Fair Secure Two-Party Computation
? In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits. Later, several protocols based on garbled circuits covering malicious adversaries have been proposed. Only a few papers, however, discuss the fundamental property of fairness for two-party computation. So far the ...
متن کاملMiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
One of the main tools to construct secure two-party computation protocols are Yao garbled circuits. Using the cut-and-choose technique, one can get reasonably efficient Yao-based protocols with security against malicious adversaries. At TCC 2009, Nielsen and Orlandi [28] suggested to apply cut-andchoose at the gate level, while previously cut-and-choose was applied on the circuit as a whole. Th...
متن کاملEfficient Resettably Secure Two-Party Computation
In 2000, Canetti, Goldreich, Goldwasser and Micali (STOC’00) proposed the notion of resettable zero-knowledge, which considers the scenario where a malicious verifier can reset the prover and force it to reuse its random tape. They provided a construction that resists such attacks, and in the following, the notion of resettability was considered in various other scenarios. Starting with resetta...
متن کاملLecture 4 -general Secure Two Party and Multi Party Computation
In this lecture we will discuss secure two party and multi party computation. Assume we have m parties. Each party Pi holds a private value xi, and all parties want to compute some agreed upon function f (x2, x2..., xm). We will discuss and sketch the security requirements from such a computation and what difficulties arise from those requirements. We will present a protocol, but will not prove...
متن کاملEfficient Secure Multi-party Computation
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t < n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2827025